Special structure for Cr monotone Lyapunov functions
نویسندگان
چکیده
منابع مشابه
On copositive Lyapunov functions for a class of monotone systems
This paper considers several explicit formulas for the construction of copositive Lyapunov functions for global asymptotic stability with respect to monotone systems evolving in either discrete or continuous time. Such monotone systems arise as comparison systems in the study of interconnected large-scale nominal systems. A copositive Lyapunov function for such a comparison system can then serv...
متن کاملA Contractive Approach to Separable Lyapunov Functions for Monotone Systems
Monotone systems preserve a partial ordering of states along system trajectories and are often amenable to separable Lyapunov functions that are either the sum or the maximum of a collection of functions of a scalar argument. In this paper, we consider constructing separable Lyapunov functions for monotone systems that are also contractive, that is, the distance between any pair of trajectories...
متن کاملA Lyapunov Inequality for Monotone Quasilinear Operators
In this work we prove a Lyapunov type inequality for monotone quasilinear operators generalizing the p−Laplacian. This inequality enable us to obtain lower bounds for the first eigenvalue obtained in the setting of Orlicz-Sobolev spaces.
متن کاملMonotone circuits for monotone weighted threshold functions
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of computing them is adding the weights of the satisfied variables and checking if the sum is greater than the threshold; this algorithm is inherently non-monotone since addition is a non-monotone function. In this work w...
متن کامل2 Monotone Functions and Monotone Circuits
In the last lecture we looked at lower bounds for constant-depth circuits, proving that PARITY cannot be computed by constant-depth circuits, i.e. PARITY / ∈ AC0. General circuit lower bounds for explicit functions are quite weak: the best we can prove after years of effort is that there is a function, which requires circuits of size 5n − o(n). In this lecture we will examine what happens if we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Differential Equations
سال: 1980
ISSN: 0022-0396
DOI: 10.1016/0022-0396(80)90070-4